Concept Partition Pattern
نویسنده
چکیده
Let P be a named concept that is the partition which is divided into several concepts Ci. Then the partition is defined by introducing the following axioms (expressed in the standard DL syntax) as also be shown in Figure 1: P ≡ C0 C1 · · · Cn and Ci Cj = ⊥ for 0 ≤ i, j ≤ n, i = j. Note that some ontology languages such as OWL 2 [1] provides disjointness axioms as syntactical sugar to make the definition of pair-wise disjointness easier. In OWL 2 the pattern can be translated into the following axioms (expressed in OWL 2 abstract syntax):
منابع مشابه
Web-Application Development Using the Model/View/Controller Design Pattern
The ModelNiew/Controller design pattern is very useful for architecting interactive software systems. This design pattern is partition-independent, because it is expressed in terms of an interactive application running in a single address space. Applying the ModelNiew/Controller design pattern to web-applications is therefore complicated by the fact that current technologies encourage developer...
متن کاملPii: S0031-3203(97)00113-1
Thresholding is an important topic for image processing, pattern recognition and computer vision. Selecting thresholds is a critical issue for many applications. The fuzzy set theory has been successfully applied to many areas, such as control, image processing, pattern recognition, computer vision, medicine, social science, etc. It is generally believed that image processing bears some fuzzine...
متن کاملFoundations of Classification
Classification is one of the main tasks in machine learning, data mining, and pattern recognition. A granular computing model is suggested for learning two basic issues of concept formation and concept relationship identification. A classification problem can be considered as a search for suitable granules organized under a partial order. The structures of search space, solutions to a consisten...
متن کاملDynamical distance as a semi-metric on nuclear conguration space
In this paper, we introduce the concept of dynamical distance on a nuclear conguration space. We partition the nuclear conguration space into disjoint classes. This classification coincides with the classical partitioning of molecular systems via the concept of conjugacy of dynamical systems. It gives a quantitative criterion to distinguish dierent molecular structures.
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009